Using Mixed Universal and Rigid E-Unification to Handle Equality in Universal Formula Semantic Tableaux
نویسنده
چکیده
In this paper we describe how a combination of the classical “universal” E-unification and “rigid” Eunification, called “mixed” E-unification, can be used to efficiently handle equality in universal formula semantic tableaux, that are an extension of free variable tableaux.
منابع مشابه
Using E - Unification to Handle Equality in Universal Formula Semantic Tableaux — Extended
In this paper we describe how a combination of the classical “universal” E-unification and “rigid”E-unification, called “mixed” E-unification, can be used to efficiently handle equality in universal formula semantic tableaux, that are an extension of free variable tableaux.
متن کاملA Completion-Based Method for Mixed Universal and Rigid E-Unification
We present a completion-based method for handling a new version of E-unification, called “mixed” E-unification, that is a combination of the classical “universal” E-unification and “rigid” E-unification. Rigid E-unification is an important method for handling equality in Gentzen-type first-order calculi, such as free-variable semantic tableaux or matings. The performance of provers using E-unif...
متن کاملBernhard Beckert Rigid E - Unification
By replacing syntactical unification with rigid E-unification, equality handling can be added to rigid variable calculi for first-order logic, including free variable tableau (Fitting, 1996), the mating method (Andrews, 1981), the connection method (Bibel, 1982), and model elimination (Loveland, 1969); for an overview of these calculi, see Chapters I.1.1 and I.1.2. Rigid E-unification and its s...
متن کاملRigid E-unification
By replacing syntactical unification with rigid E-unification, equality handling can be added to rigid variable calculi for first-order logic, including free variable tableau (Fitting, 1996), the mating method (Andrews, 1981), the connection method (Bibel, 1982), and model elimination (Loveland, 1969); for an overview of these calculi, see Chapters I.1.1 and I.1.2. Rigid E-unification and its s...
متن کاملThe Undecidability of Simultaneous Rigid E-Unification with Two Variables
Recently it was proved that the problem of simultaneous rigid E-unification, or SREU, is undecidable. Here we show that 4 rigid equations with ground left-hand sides and 2 variables already imply undecidability. As a corollary we improve the undecidability result of the 3*-fragment of intuitionistic logic with equality. Our proof shows undecidability of a very restricted subset of the 33-fragme...
متن کامل